منابع مشابه
Randomized Shortest-Path Problems: A first study
Suppose you have to route agents through a network from a source node to a destination node in some optimal way; for instance by minimizing the total travel cost. Nothing new up to now – you could use a standard shortestpath algorithm. Suppose, however, that you want to avoid pure deterministic routing policies in order, for instance, to allow some exploration of the network, to avoid congestio...
متن کاملOpen shortest path first routing under random early detection
In this paper we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we consider in this paper we only require a single network path be available between each origin and destination, a simplification of the OSPF protocol. We formulate a mixed integer nonlinea...
متن کاملOpen Problem: Online Sabotaged Shortest Path
There has been much work on extending the prediction with expert advice methodology to the case when experts are composed of components and there are combinatorially many such experts. One of the core examples is the Online Shortest Path problem where the components are edges and the experts are paths. In this note we revisit this online routing problem in the case where in each trial some of t...
متن کاملBionomic Algorithm for Shortest Path First
In this paper we propose the idea of using Bionomic Algorithm (BA) for the shortest path finding problem. SPF is a very important issue associated with many other tasks like network routing and graph/map analysis etc. Different techniques have been used for solving the SPF problem, some of them being Dijkstra Algorithm, Floyd Algorithm, Genetic Algorithm, Tabu Search etc. The choice of algorith...
متن کاملAvoiding Ties in Shortest Path First Routing
First we discuss problems associated with ties and flow splitting with shortest path first protocols such as OSPF and IS-IS. The problems relate to uncertainty in the splitting when there are multiple shortest path from a source to a destination. Even if routers are configured for even splitting, there can easily be unpredicted biases that can overload links and thereby affect quality of servic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IJARCCE
سال: 2017
ISSN: 2278-1021
DOI: 10.17148/ijarcce.2017.6696